package leetcode.剑指offer;

public class 旋转数组的最小数字11 {
    public int minArray(int[] numbers) {
        if (numbers == null)
            return -1;
        int L = 0;
        int R = numbers.length - 1;

        if (numbers[L] < numbers[R])
            return numbers[L];
        while (numbers[L] >= numbers[R] && L < R && R - 1 > 0 && numbers[R - 1] < numbers[R]) {
            R--;
        }
        return numbers[R];
    }
}
